CAT(0) cube complexes are determined by their boundary cross ratio
نویسندگان
چکیده
We introduce a $\mathbb{Z}$-valued cross ratio on Roller boundaries of ${\rm CAT(0)}$ cube complexes. motivate its relevance by showing that every cross-ratio preserving bijection uniquely extends to cubical isomorphism. Our results are strikingly general and even apply infinite dimensional, locally complexes with trivial automorphism group.
منابع مشابه
Knots Are Determined by Their Complements
The notion of equivalence of knots can be strengthened by saying that K and K' are isotopic if the above homeomorphism h is isotopic to the identity, or equivalently, orientation-preserving. The analog of Theorem 1 holds in this setting too: if two knots have complements which are homeomorphic by an orientation-preserving homeomorphism, then they are isotopic. Theorem 1 and its orientation-pres...
متن کاملKnots Are Determined by Their Complements
This answers a question apparently first raised by Tietze [T, p. 83]. It was previously known that there were at most two knots with a given complement [CGLS, Corollary 3]. The notion of equivalence of knots can be strengthened by saying that K and K' are isotopic if the above homeomorphism h is isotopic to the identity, or, equivalently, orientation-preserving. The analog of Theorem I holds in...
متن کاملCycles are determined by their domination polynomials
Let G be a simple graph of order n. A dominating set of G is a set S of vertices of G so that every vertex of G is either in S or adjacent to a vertex in S. The domination polynomial of G is the polynomial D(G,x) = ∑n i=1 d(G, i)x , where d(G, i) is the number of dominating sets of G of size i. In this paper we show that cycles are determined by their domination polynomials. AMS Classification:...
متن کاملWhich graphs are determined by their spectrum?
For almost all graphs the answer to the question in the title is still unknown. Here we survey the cases for which the answer is known. Not only the adjacency matrix, but also other types of matrices, such as the Laplacian matrix, are considered. © 2003 Elsevier Inc. All rights reserved.
متن کاملRegular networks are determined by their trees
A rooted acyclic digraph N with labelled leaves displays a tree T when there exists a way to select a unique parent of each hybrid vertex resulting in the tree T . Let Tr(N) denote the set of all trees displayed by the network N . In general, there may be many other networks M such that Tr(M) = Tr(N). A network is regular if it is isomorphic with its cover digraph. This paper shows that if N is...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Groups, Geometry, and Dynamics
سال: 2021
ISSN: ['1661-7207', '1661-7215']
DOI: https://doi.org/10.4171/ggd/599